Fast Soundness Verification of Workflow Graphs
نویسنده
چکیده
This paper shows a new approach to check the soundness of workflow graphs. The algorithm is complete and allows a very good localization of the structural conflicts, i.e. local deadlocks and lack of synchronizations. The evaluation shows a linear processing time in the average and an up to quadratic in the worst case.
منابع مشابه
Visualizing the Soundness of Workflow Nets
Petri nets and in particular workflow nets as a process description language allow the application of formal verification methods, e.g., to prove soundness. Although tools for soundness checks do already exist , it is still difficult for the workflow designer to correct the process model according to the output of these tests – mostly because diagnostic messages are not directly linked to the g...
متن کاملAn analytical method for well-formed workflow/Petri net verification of classical soundness
In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavio...
متن کاملAn Alternative Way to Analyze Workflow Graphs
At the CAiSE conference in Heidelberg in 1999, Wasim Sadiq and Maria Orlowska presented an algorithm to verify workflow graphs [19]. The algorithm uses a set of reduction rules to detect structural conflicts. This paper shows that the set of reduction rules presented in [19] is not complete and proposes an alternative algorithm. The algorithm translates workflow graphs into so-called WF-nets. W...
متن کاملVerifying soundness of business processes: A decision process Petri nets approach
This paper presents a trajectory-tracking approach for verifying soundness of workflow/Petri nets represented by a decision-process Petri net. Well-formed business processes correspond to sound workflow nets. The advantage of this approach is its ability to represent the dynamic behavior of the business process. We show that the problem of finding an optimum trajectory for validation of well-fo...
متن کاملSoundness of Workflow Nets with Reset Arcs is Undecidable !
Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation...
متن کامل